A Density Theorem for Weighted Fekete Sets

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An intersection theorem for weighted sets

A weight function ! : 2 → R¿0 from the set of all subsets of [n]={1; : : : ; n} to the nonnegative real numbers is called shift-monotone in {m+1; : : : ; n} if !({a1; : : : ; aj})¿!({b1; : : : ; bj}) holds for all {a1; : : : ; aj}; {b1; : : : ; bj}⊆ [n] with ai6bi; i = 1; : : : ; j, and if !(A)¿!(B) holds for all A; B⊆ [n] with A⊆B and B\A⊆{m + 1; : : : ; n}. A family F⊆ 2 is called intersectin...

متن کامل

Approximate Fekete Points for Weighted Polynomial Interpolation

We compute approximate Fekete points for weighted polynomial interpolation by a recent algorithm based on QR factorizations of Vandermonde matrices. We consider in particular the case of univariate and bivariate functions with prescribed poles or other singularities, which are absorbed in the basis by a weight function. Moreover, we apply the method to the construction of real and complex weigh...

متن کامل

Computation of Elliptic Fekete Point Sets

The objective of this work is to provide a methodology for approximating globally optimal Fekete point con-gurations. This problem is of obvious interest in numerical mathematics and scientic modeling. Following a brief discussion of the pertinent analytical background, Lipschitz global optimization (LGO) is applied to determine {i.e., to numerically approximate{ Fekete point congurations. Next...

متن کامل

Fekete Polynomials and Shapes of Julia Sets

We prove that a nonempty, proper subset S of the complex plane can be approximated in a strong sense by polynomial filled Julia sets if and only if S is bounded and Ĉ \ int(S) is connected. The proof that such a set is approximable by filled Julia sets is constructive and relies on Fekete polynomials. Illustrative examples are presented. We also prove an estimate for the rate of approximation i...

متن کامل

Strong convergence theorem for a class of multiple-sets split variational inequality problems in Hilbert spaces

In this paper, we introduce a new iterative algorithm for approximating a common solution of certain class of multiple-sets split variational inequality problems. The sequence of the proposed iterative algorithm is proved to converge strongly in Hilbert spaces. As application, we obtain some strong convergence results for some classes of multiple-sets split convex minimization problems.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: International Mathematics Research Notices

سال: 2016

ISSN: 1073-7928,1687-0247

DOI: 10.1093/imrn/rnw161